#include "RBTree.h"

void Test1()
{
	int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	//int a[] = {4, 2, 6, 1, 3, 5, 15, 7, 16, 14};
	RBTree<int, int> t;
	for (auto& e : a)
	{
		if (e == 2)
		{
			int i = 0;
		}
		t.Insert(std::make_pair(e, e));
		//std::cout << t.IsBalanceTree() << std::endl;
	}
	t.InOrder();
	std::cout << t.IsBalanceTree() << std::endl;
	//std::cout << t.IsBalanceTree() << std::endl;
	std::cout << std::endl;

}

int main()
{
	Test1();
	return 0;
}